Scenery reconstruction on finite abelian groups
نویسندگان
چکیده
منابع مشابه
Scenery Reconstruction on Finite Abelian Groups
We consider the question of when a random walk on a finite abelian group with a given step distribution can be used to reconstruct a binary labeling of the elements of the group, up to a shift. Matzinger and Lember (2006) give a sufficient condition for reconstructibility on cycles. While, as we show, this condition is not in general necessary, our main result is that it is necessary when the l...
متن کاملOn non-normal non-abelian subgroups of finite groups
In this paper we prove that a finite group $G$ having at most three conjugacy classes of non-normal non-abelian proper subgroups is always solvable except for $Gcong{rm{A_5}}$, which extends Theorem 3.3 in [Some sufficient conditions on the number of non-abelian subgroups of a finite group to be solvable, Acta Math. Sinica (English Series) 27 (2011) 891--896.]. Moreover, we s...
متن کاملOn $m^{th}$-autocommutator subgroup of finite abelian groups
Let $G$ be a group and $Aut(G)$ be the group of automorphisms of $G$. For any natural number $m$, the $m^{th}$-autocommutator subgroup of $G$ is defined as: $$K_{m} (G)=langle[g,alpha_{1},ldots,alpha_{m}] |gin G,alpha_{1},ldots,alpha_{m}in Aut(G)rangle.$$ In this paper, we obtain the $m^{th}$-autocommutator subgroup of all finite abelian groups.
متن کاملon finite a-perfect abelian groups
let $g$ be a group and $a=aut(g)$ be the group of automorphisms of $g$. then the element $[g,alpha]=g^{-1}alpha(g)$ is an autocommutator of $gin g$ and $alphain a$. also, the autocommutator subgroup of g is defined to be $k(g)=langle[g,alpha]|gin g, alphain arangle$, which is a characteristic subgroup of $g$ containing the derived subgroup $g'$ of $g$. a group is defined...
متن کاملDecomposing finite Abelian groups
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann Hypothesis) also leads to an efficient algorithm for computing class numbers (known to be at least as difficult as factoring).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2014
ISSN: 0304-4149
DOI: 10.1016/j.spa.2014.03.012